Calculating the Degree Distance of Partial Hamming Graphs
نویسندگان
چکیده
If G is a connected graph with vertex set V (G), then the degree distance of G is defined as DD(G) = ∑ {u,v}∈V (G)(deg u + deg v)d(u, v), where deg u is the degree of vertex u, and d(u, v) denotes the distance between u and v. In the chemical literature, DD(G) is better known under ‡Corresponding author. If possible, send your correspondence via e-mail. the name Schultz index. In the class of partial Hamming graphs, which include trees, benzenoid and phenylene systems among others, we express the degree distance in terms of the canonical metric representation, thus simplifying its computation.
منابع مشابه
On the canonical metric representation of graphs and partial Hamming graphs
Average distance of a graph is bounded in terms of its canonical metric representation. The inequality in particular yields a characterization of isometric subgraphs of Hamming graphs which in turn simplifies recognition of these graphs and computation of average distance.
متن کاملHamming polynomials and their partial derivatives
Hamming graphs are Cartesian products of complete graphs and partial Hamming graphs are their isometric subgraphs. The Hamming polynomial h(G) of a graph G is introduced as the Hamming subgraphs counting polynomial. Kk-derivates ∂kG (k ≥ 2) of a partial Hamming graph are also introduced. It is proved that for a partial Hamming graph G, ∂h(G) ∂xk = h(∂kG). A couple of combinatorial identities in...
متن کاملGeneralized Degree Distance of Strong Product of Graphs
In this paper, the exact formulae for the generalized degree distance, degree distance and reciprocal degree distance of strong product of a connected and the complete multipartite graph with partite sets of sizes m0, m1, . . . , mr&minus1 are obtained. Using the results obtained here, the formulae for the degree distance and reciprocal degree distance of the closed and open fence graphs are co...
متن کاملOn reverse degree distance of unicyclic graphs
The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...
متن کاملTree-like partial Hamming graphs
Tree-like partial cubes were introduced in [B. Brešar, W. Imrich, S. Klavžar, Tree-like isometric subgraphs of hypercubes, Discuss. Math. Graph Theory, 23 (2003), 227–240] as a generalization of median graphs. We present some incorrectnesses from that article. In particular we point to a gap in the proof of the theorem about the dismantlability of the cube graph of a tree-like partial cube and ...
متن کامل